Inductive Reasoning for Shape Invariants pdfsubject
نویسندگان
چکیده
Automatic verification of imperative programs that destructively manipulate heap data structures is challenging. In this paper we propose an approach for verifying that such programs do not corrupt their data structures. We specify heap data structures such as lists, arrays of lists, and trees inductively as solutions of logic programs. We use off-the-shelf first-order theorem provers to reason about these specifications.
منابع مشابه
Automating Program Proofs Based on Separation Logic with Inductive Definitions
This paper investigates the use of Separation Logic with inductive definitions in reasoning about programs that manipulate dynamic data structures. We propose a novel approach for exploiting the inductive definitions in automating program proofs based on inductive invariants. We focus on iterative programs, although our techniques apply to recursive programs as well, and specifications that des...
متن کاملInductive Invariants for Nested Recursion
We show that certain input-output relations, termed inductive invariants are of central importance for termination proofs of algorithms defined by nested recursion. Inductive invariants can be used to enhance the standard recdef definition package in Isabelle/HOL. We also offer a formalized theory in higher-order logic that incorporates inductive invariants and that can be used as an alternativ...
متن کاملCut-Based Inductive Invariant Computation
This paper presents a new way of computing inductive invariants in sequential designs. The invariants are useful for strengthening inductive proofs in difficult unbounded model checking instances. Candidate invariants are derived from a set of m-feasible cuts in the logic network and proved by induction. Thus, the proposed computation is very scalable, and it is possible to flexibly trade compu...
متن کاملOn the Inductive Algorithm of Resolution of Singularities by S. Encinas and O. Villamayor
Chapter 0. Introduction Chapter 1. Basic objects and invariants Chapter 2. Resolution of singularities of monomial basic objects Chapter 3. Key inductive lemma Chapter 4. General basic objects and invariants Chapter 5. Inductive algorithm for resolution of singularities of general basic objects Chapter 6. A more down-to-earth approach to the inductive algorithm Chapter 7. Embedded resolution of...
متن کاملDeductive Verification of Continuous Dynamical Systems
We define the notion of inductive invariants for continuous dynamical systems and use it to present inference rules for safety verification of polynomial continuous dynamical systems. We present two different sound and complete inference rules, but neither of these rules can be effectively applied. We then present several simpler and practical inference rules that are sound and relatively compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009